The Art Gallery Theorem for Rectilinear Polygons with Holes
نویسنده
چکیده
It is proved that any rectilinear polygon on n vertices, possibly with holes, can be partitioned into at most n 4 rectilinear stars each of size at most 12.
منابع مشابه
The Art Gallery Theorem for Polyominoes
We explore the art gallery problem for the special case that the domain (gallery) P is an mpolyomino, a polyform whose cells are m unit squares. We study the combinatorics of guarding polyominoes in terms of the parameter m, in contrast with the traditional parameter n, the number of vertices of P . In particular, we show that ⌊ 3 ⌋ point guards are always sufficient and sometimes necessary to ...
متن کاملApproximability of guarding weak visibility polygons
The art gallery problem enquires about the least number of guards that are sufficient to ensure that an art gallery, represented by a polygon P , is fully guarded. In 1998, the problems of finding the minimum number of point guards, vertex guards, and edge guards required to guard P were shown to be APX-hard by Eidenbenz, Widmayer and Stamm. In 1987, Ghosh presented approximation algorithms for...
متن کاملVertex Guarding in Weak Visibility Polygons
The art gallery problem enquires about the least number of guards that are sufficient to ensure that an art gallery, represented by a polygon P , is fully guarded. In 1998, the problems of finding the minimum number of point guards, vertex guards, and edge guards required to guard P were shown to be APX-hard by Eidenbenz, Widmayer and Stamm. In 1987, Ghosh presented approximation algorithms for...
متن کاملApproximation algorithms for art gallery problems in polygons
In this paper, we present approximation algorithms for minimum vertex and edge guard problems for polygonswith or without holes with a total of n vertices. For simple polygons, approximation algorithms for both problems run in O(n4) time and yield solutions that can be at most O(log n) times the optimal solution. For polygons with holes, approximation algorithms for both problems give the same ...
متن کاملInapproximability Results for Guarding Polygons and Terrains 1
Past research on art gallery problems has concentrated almost exclusively on bounds on the numbers of guards needed in the worst case in various settings. On the complexity side, fewer results are available. For instance, it has long been known that placing a smallest number of guards for a given input polygon is NP-hard. In this paper we initiate the study of the approximability of several typ...
متن کامل